#ifndef FILLMAXIMALGROUPALGORITHMUNITTESTS_H
#define FILLMAXIMALGROUPALGORITHMUNITTESTS_H

#include "stdafx.h"
#include "TestUtils.h"
#include "GreedyFillMaximalGroupAlgorithm.h"
#include "FillGroupAlgorithmSinglesUnitTests.h"
#include <cstdlib>


// Create a graph and a group, try to improve the group
TestUtils::TestResult FillMaximalGroup4On2(int iterationNum, int startCouplesPercent, int stopCouplesPercent); 

// Create a graph and an empty group, try to improve the group
TestUtils::TestResult FillMaximalEmptyGroup4On2(); 

// Create a graph and a group, try to improve the group without initial filling of the group
TestUtils::TestResult FillMaximalGroup4On2WithoutInitialFilling(int iterationNum, int startCouplesPercent, int stopCouplesPercent);

// Try to improve a group using the FIllMaximalGroup algorithm but without initial fiiling of the group
TestUtils::TestResult FillMaximalGroup4On2WithoutInitialFillingWithoutCuplesFill(int iterationNum, int stopCouplesPercent);


#endif //FILLMAXIMALGROUPALGORITHMUNITTESTS_H